A branch-and-cut algorithm for the capacitated profitable tour problem
نویسندگان
چکیده
A branch-and-cut algorithm for the capacitated profitable tour problem.
منابع مشابه
New Models and Methods for Arc Routing
The talk presents two non-standard extensions for singlevehicle arc-routing problems a.k.a. postman problems: First, street segments that require a service on both sides of the street can be covered either by two separate services or by a single zigzag service. Instead of deciding the type of service beforehand, we propose to take into account the zigzagging option when designing a tour. We pre...
متن کاملA Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters
In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...
متن کاملA Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
The Capacitated m-ring-star Problem is a variant of the classical one-depot capacitated vehicle routing problem in which a customer is either on a route or is connected to another customer or to some Steiner point present in a route. We develop a new exact algorithm for this problem using a branch-and-cut-and-price approach and compare its performance with that of a branch-and-cut algorithm pro...
متن کاملThree Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملA Branch-and-Cut Algorithm for the Non-Preemptive Capacitated Swapping Problem
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraphG = (V,A), at every vertex of which there may be one unit of supply of an item, one unit of demand, or both. The objective is to determine a minimum cost capacitated vehicle route to transport the items in such a way that all demands are satisfied. The vehicle ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 14 شماره
صفحات -
تاریخ انتشار 2014